Adaptive Tuple Differential Coding
نویسندگان
چکیده
It is desirable to employ compression techniques in Relational OLAP systems to reduce disk space requirements and increase disk I/O throughput. Tuple Differential Coding (TDC) techniques have been introduced to compress views on a tuple level by storing only the differences between consecutive ordered tuples. These techniques work well for highly regular data in which the differences between tuples are fairly constant but are less effective on real data containing either skew or outliers. In this paper we introduce Adaptive Tuple Differential Coding (ATDC), which employs optimization techniques to analyze blocks of tuples to detect large tuple differences, with the purpose of isolating them to minimize their negative effect on the compression of neighbouring tuples. Our experiments show that this new algorithm provides an increase in compression ratio of 15–30% over TDC on typical real datasets.
منابع مشابه
- 0 - 521 - 11432 - 5 - Compression for Multimedia
centroid, 19, 25, 30 circular displacement, 102 code convolutional, 36, 58 Elias, 256 Gallager-vanVoorhis, 255 Golomb, 218, 254 Golomb–Rice, 188 Levenstein, 256 monotonic, 254 prefix-free, 239 terminated convolutional, 37 trellis, 38 unary, 254 zero-tail terminated convolutional, 37 codebook, 26, 27 adaptive, 154 adaptive gain, 155 stochastic, 156 stochastic gain, 156 codec ACELP, 158 code exci...
متن کاملAsymptotic Analysis of Multiple Description Lattice Vector Quantization
Recent results have shown that general K-channel multiple-description-coding (MDC) approaches often have significant advantages over conventional twochannel MDC methods. We provide new asymptotic results to describe the performance of a general K-channel symmetric MDC lattice vector quantizer (MDLVQ). We consider a memoryless L-dimensional source with probability density function f and differen...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملDeveloping Adaptive Differential Evolution as a New Evolutionary Algorithm, Application in Optimization of Chemical Processes
متن کامل
Adaptive Spectral Separation Two Layer Coding with Error Concealment for Cell Loss Resilience
This paper addresses the issue of cell loss and its consequent effect on video quality in a packet video system, and examines possible compensative measures. In the system's enconder, adaptive spectral separation is used to develop a two-layer coding scheme comprising a high priority layer to carry essential video data and a low priority layer with data to enhance the video image. A two-step er...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007